Bi-Covering: Covering Edges with Two Small Subsets of Vertices
نویسندگان
چکیده
منابع مشابه
Bi-Covering: Covering Edges with Two Small Subsets of Vertices
We study the following basic problem called Bi-Covering. Given a graph GpV,Eq, find two (not necessarily disjoint) sets A Ď V and B Ď V such that A Y B “ V and that every edge e belongs to either the graph induced by A or to the graph induced by B. The goal is to minimize maxt|A|, |B|u. This is the most simple case of the Channel Allocation problem [13]. A solution that outputs V,H gives ratio ...
متن کاملCovering vertices by a specified number of disjoint cycles, edges and isolated vertices
Let n, k be integers with n ≥ k ≥ 2, and let G be a graph of order n and S be a subset of V (G). We define μ(S) := min { max{dG(x), dG(y)} | x, y ∈ S, x 6= y, xy / ∈ E(G) } if there exist two nonadjacent vertices in S; otherwise μ(S) := +∞. Fujita [Discrete Math. 309 (2009) 3534–3540] proved that if μ(V (G)) ≥ (n − k + 1)/2, then G contains k vertex-disjoint subgraphs H1, . . . ,Hk such that ∪k...
متن کاملApproximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or vertices, respectively, of a graph. We consider the generalized partial cover version of these problems, in which failing to cover an edge, in the EDS case, or vertex, in the EC case, induces a penalty. The objective is ...
متن کاملProfiles of covering arrays of strength two
Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...
متن کاملEfficiently covering complex networks with cliques of similar vertices
We describe a polynomial time algorithm for covering graphs with cliques, prove its asymptotic optimality in a random intersection graph model and present experimental results on complex real–world networks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2017
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1082421